318. Maximum Product of Word Lengths - LeetCode Solution

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        
        
        a = []
        
        for  i in range(len(words)):
            d = {}
            for j in range(len(words[i])):
                if words[i][j] in d:
                    d[words[i][j]] +=1
                else:
                    d[words[i][j]] = 1
            
            a.append(d)
        
        
        ans = 0
  
        
        for i in range(len(a)):
            for j in range(i+1 ,len(a) , 1):
                
                flag = 0
                for k in a[i]:
                    if k in a[j]:
                        flag = 1
                        break
                
                if flag == 0:
                    ans = max(ans, len(words[i]) * len(words[j]))
        
        return ans